Injectivity analysis using interval analysis: Application to structural identifiability

نویسندگان

  • Sebastien Lagrange
  • Nicolas Delanoue
  • Luc Jaulin
چکیده

This paper presents a new numerical algorithm based on interval analysis able to prove that a differentiable function f : A ⊂ R → R is injective. This algorithm also performs a partition of the domain A in subsets Ai where, for all x ∈ Ai, the cardinality of f−1(f(x)) is constant. In the context of parameter estimation, we show how this algorithm provides an efficient and numerical method to study the structural identifiability of parametric models.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Identifiability and Reconstruction of Shapes from Integral Invariants

Abstract. Integral invariants have been proven to be useful for shape matching and recognition, but fundamental mathematical questions have not been addressed in the computer vision literature. In this article we are concerned with the identifiability and numerical algorithms for the reconstruction of a star-shaped object from its integral invariants. In particular we analyse two integral invar...

متن کامل

Structural Identifiability of some Biotechnological Systems

In this paper we present an algorithm for nonlinear continuous-time model structural identifiability analysis. The method can be included in the transformation of nonlinear models framework of structural identifiability analysis and is based on test functions from distribution theory. So, the nonlinear continuous-time models are transformed in linear in parameters models by replacing the state ...

متن کامل

Optimal Injectivity Conditions for Bilinear Inverse Problems with Applications to Identifiability of Deconvolution Problems

We study identifiability for bilinear inverse problems under sparsity and subspace constraints. We show that, up to a global scaling ambiguity, almost all such maps are injective on the set of pairs of sparse vectors if the number of measurements m exceeds 2(s1+ s2)− 2, where s1 and s2 denote the sparsity of the two input vectors, and injective on the set of pairs of vectors lying in known subs...

متن کامل

Comparison of approaches for parameter identifiability analysis of biological systems

MOTIVATION Modeling of dynamical systems using ordinary differential equations is a popular approach in the field of Systems Biology. The amount of experimental data that are used to build and calibrate these models is often limited. In this setting, the model parameters may not be uniquely determinable. Structural or a priori identifiability is a property of the system equations that indicates...

متن کامل

Identifiability Analysis of a Liquid-liquid Phase-transfer Catalyzed Reaction System

Identifiability is a structural property of mathematical models. A model is identifiable if the model parameters can be uniquely identified from input-output behaviour. This work focuses on the application of a novel methodology for testing differential algebraic equation systems for identifiability. In this work, a non-linear, differential algebraic model of a liquid-liquid phase-transfer reac...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Automatica

دوره 44  شماره 

صفحات  -

تاریخ انتشار 2008